ar X iv : 1 50 2 . 06 22 0 v 1 [ cs . C V ] 2 2 Fe b 20 15 SOS Boosting of Image Denoising Algorithms
نویسنده
چکیده
In this paper we propose a generic recursive algorithm for improving image denoising methods. Given the initial denoised image, we suggest repeating the following ”SOS” procedure: (i) Strengthen the signal by adding the previous denoised image to the degraded input image, (ii) Operate the denoising method on the strengthened image, and (iii) Subtract the previous denoised image from the restored signal-strengthened outcome. The convergence of this process is studied for the K-SVD image denoising and related algorithms. Furthermore, still in the context of K-SVD image denoising, we introduce an interesting interpretation of the SOS algorithm as a technique for closing the gap between the local patch-modeling and the global restoration task, thereby leading to improved performance. We demonstrate the SOS boosting algorithm for several leading denoising methods (K-SVD, NLM, BM3D, and EPLL), showing tendency to further improve denoising performance.
منابع مشابه
ar X iv : 1 50 2 . 06 22 0 v 2 [ cs . C V ] 1 2 M ar 2 01 5 Boosting of Image Denoising Algorithms ∗
In this paper we propose a generic recursive algorithm for improving image denoising methods. Given the initial denoised image, we suggest repeating the following ”SOS” procedure: (i) (S)trengthen the signal by adding the previous denoised image to the degraded input image, (ii) (O)perate the denoising method on the strengthened image, and (iii) (S)ubtract the previous denoised image from the r...
متن کاملar X iv : 0 80 2 . 15 86 v 1 [ cs . S E ] 1 2 Fe b 20 08 Program Promises
The framework of promise theory offers an alternative way of understanding programming models, especially in distributed systems. We show that promise theory can express some familiar constructs and resolve some problems in program interface design, using fewer and simpler concepts than the Unified Modelling Language (UML).
متن کاملar X iv : g r - qc / 0 30 20 06 v 2 1 1 Fe b 20 03 Time variation of the gravitational and fine structure constants in models with extra dimensions
We derive formulae for the time variation of the gravitational " constant " and of the fine structure " constant " in various models with extra dimensions and analyze their consistency with the observational data.
متن کاملar X iv : m at h / 06 02 64 7 v 1 [ m at h . A G ] 2 8 Fe b 20 06 HIGHER FANO MANIFOLDS AND RATIONAL SURFACES
Let X be a Fano manifold of pseudo-index ≥ 3 such that c 1 (X) 2 − 2c 2 (X) is nef. Irreducibility of some spaces of rational curves on X (in fact, a weaker hypothesis) implies a general point of X is contained in a rational surface.
متن کاملar X iv : n lin / 0 50 20 61 v 1 [ nl in . C G ] 2 6 Fe b 20 05 Two Cellular Automata for the 3 x + 1 Map
Two simple Cellular Automata, which mimic the Collatz-Ulam iterated map (3x + 1 map), are introduced. These Cellular Automata allow to test efficiently the Collatz conjecture for very large numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015